MidL: a SAT(ID) Solver
نویسندگان
چکیده
We introduce SAT(ID) and explain its relation both to SAT and to ASP. We then describe the SAT(ID) solver MidL. We outline its design and algorithms, and finally establish its performance by experiment.
منابع مشابه
Integrating Inductive Definitions in SAT
We investigate techniques for supporting inductive definitions (IDs) in SAT, and report on an implementation, called MidL, of the resulting solver. This solver was first introduced in [11], as a part of a declarative problem solving framework. We go about our investigation by proposing a new formulation of the semantics of IDs as presented in [2]. This new formulation suggests a way to perform ...
متن کاملSatisfiability Checking for PC(ID)
The logic FO(ID) extends classical first order logic with inductive definitions. This paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for model generation in this logic, present an algorithm and prove its correctness. As FO(ID) is an integration of classical logic and logic programming, our algorithm integrates techniques from SAT and ASP...
متن کاملImplementing a Relevance Tracker Module
PC(ID) extends propositional logic with inductive definitions: rule sets under the well-founded semantics. Recently, a notion of relevance was introduced for this language. This notion determines the set of undecided literals that can still influence the satisfiability of a PC(ID) formula in a given partial assignment. The idea is that the PC(ID) solver can make decisions only on relevant liter...
متن کاملReducing Inductive Definitions to Propositional Satisfiability
The FO(ID) logic is an extension of classical first-order logic with a uniform representation of various forms of inductive definitions. The definitions are represented as sets of rules and they are interpreted by two-valued well-founded models. For a large class of combinatorial and search problems, knowledge representation in FO(ID) offers a viable alternative to the paradigm of Answer Set Pr...
متن کاملA Fast SAT Solver for Isabelle in Standard ML
This contribution contains a fast SAT solver for Isabelle written in Standard ML. By loading the theory DPT SAT Solver, the SAT solver installs itself (under the name “dptsat”) and certain Isabelle tools like Refute will start using it automatically. This is a port of the DPT (Decision Procedure Toolkit) SAT Solver written in OCaml. Theory DPT SAT Tests tests the solver on a few hundred problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007